The Quad Heuristic in Lines of Action

نویسندگان

  • Mark H. M. Winands
  • Jos W. H. M. Uiterwijk
  • H. Jaap van den Herik
چکیده

Lines of Action (LOA) is a two-person zero-sum chess-like connection game with perfect information. The goal of each side is to connect its own pieces. The state-space complexity and game-tree complexity are comparable with those of Othello. A LOA evaluation function usually consists of a combination of the following components: threats, solid formations, (partial) blocking, centralisation, material advantage, and mobility. In this article we introduce the quad heuristic and disregard mobility. The quad heuristic is used in three qualities, viz. (1) to assess whether a position is non-terminal, (2) to contribute to the evaluation function, and (3) to support the quiescence search. The heuristic is based on quad counts and Euler numbers, and derived from the field of optical character recognition. We show that an evaluation function using the quad heuristic outperforms evaluation functions based on the centre-of-mass approach and on (partial) blocking, i.e., evaluation functions without the quad heuristic. Moreover, it turns out that a quiescence search, which only looks at capturing moves that destroy or create connections, is quite effective when using the quad heuristic. Finally, we provide three conclusions and suggest three ways of improving the use of the quad heuristic in LOA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

متن کامل

A new heuristic method based on CPM in SALBP

The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

متن کامل

Study on gene action and combining abilities for thermotolerant ablilities of corn (Zea mays L.)

High temperature reduces the pollen viability and silk receptivity of corn resulting in poor seed set and reduced yield. Continuously increasing temperature and less frequency and distribution of rainfall coupled with usual canal–closure particularly in Pakistan have significantly been decreasing the grain yield. This problem could be overcome by developing heat tolerant maize hybrids. For this...

متن کامل

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups

  The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...

متن کامل

An Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem

In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ICGA Journal

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2001